Efficient Multicontact Pattern Generation With Sequential Convex Approximations of the Centroidal Dynamics

نویسندگان

چکیده

This paper investigates the problem of efficient computation physically consistent multi-contact behaviors. Recent work showed that under mild assumptions, could be decomposed into simpler kinematic and centroidal dynamic optimization problems. Based on this approach, we propose a general convex relaxation dynamics leading to two computationally algorithms based iterative resolutions second order cone programs. They optimize trajectories, contact forces and, importantly, timing motions. We include approach in kino-dynamic method generate full-body movements. Finally, is embedded mixed-integer solver further find dynamically sequences. Extensive numerical experiments demonstrate computational efficiency suggesting it used fast receding horizon control loop. Executions planned motions simulated humanoids quadrupeds real quadruped robot show quality optimized

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Sequential Pattern Mining Algorithms

Sequential pattern mining is a heavily researched area in the field of data mining with wide variety of applications. The task of discovering frequent sequences is challenging, because the algorithm needs to process a combinatorially explosive number of possible sequences. Most of the methods dealing with the sequential pattern mining problem are based on the approach of the traditional task of...

متن کامل

SPMLS : An Efficient Sequential Pattern Mining Algorithm with candidate Generation and Frequency Testing

Sequential pattern mining is a fundamental and essential field of data mining because of its extensive scope of applications spanning from the forecasting the user shopping patterns, and scientific discoveries. The objective is to discover frequently appeared sequential patterns in given set of sequences. Now-a-days, many studies have contributed to the efficiency of sequential pattern mining a...

متن کامل

Sequential Convex Programming for the Efficient Verification of Parametric MDPs

Multi-objective verification problems of parametric Markov decision processes under optimality criteria can be naturally expressed as nonlinear programs. We observe that many of these computationally demanding problems belong to the subclass of signomial programs. This insight allows for a sequential optimization algorithm to efficiently compute sound but possibly suboptimal solutions. Each sta...

متن کامل

Using non-convex approximations for efficient analysis of timed automata

The reachability problem for timed automata asks if there exists a path from an initial state to a target state. The standard solution to this problem involves computing the zone graph of the automaton, which in principle could be infinite. In order to make the graph finite, zones are approximated using an extrapolation operator. For reasons of efficiency in current algorithms extrapolation of ...

متن کامل

Diagnostic Test Pattern Generation for Sequential Circuits

A method to perform diagnostic test generation in sequential circuits by modifying a conventional test generator is presented. The method utilizes circuit netlist modification along with a forced value at a primary input in the modified circuit. Techniques to reduce the computational effort for diagnostic test pattern generation in sequential circuits are also presented. Speed-up of the diagnos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Robotics

سال: 2021

ISSN: ['1552-3098', '1941-0468', '1546-1904']

DOI: https://doi.org/10.1109/tro.2020.3048125